Performance study of supertree methods

نویسنده

  • Patrick Niehaus
چکیده

INTRODUCTION Phylogenetic trees depict the relationships among varying species [1]. A simple example of this is a family tree. When referring to Figure 1, the three most important components of a tree include: the Node(s) (denoted by squares), the Branches (denoted by lines), and the Tips (denoted by circles). The Nodes represent the hypothetical ancestors. The Branches represent the evolution of a lineage. Lastly, the Tips represent the species being studied. Most phylogenetic trees are estimated from DNA sequence data. A supertree is a phylogenetic tree estimate which is produced by merging smaller phylogenetic tree estimates together [2-4]. By combining several phylogenetic trees together, we can gain a better understanding of how species are related to one another. One example would be combining the human and primate phylogenetic trees. MRP works by translating each branch of each individual tree into a matrix column; this process is repeated until a character matrix is formed [5,6]. All taxa that descend from the branch are represented in the matrix with a ‘1’, other taxa that are found in the tree are represented with a ‘0’, and taxa that aren’t found in the tree are represented with the missing data symbol ‘?’. Each branch of each input tree is encoded as a series of columns. Once complete, the character matrix includes all of the phylogenetic relationships contained in the source trees. The supertree is estimated from this Q&A

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial Supertree Methods Revisited

Supertree methods allow to reconstruct large phylogenetic trees by combining smaller trees with overlapping leaf sets into one, more comprehensive supertree. The most commonly used supertree method, matrix representation with parsimony (MRP), produces accurate supertrees but is rather slow due to the underlying hard optimization problem. In this paper, we present an extensive simulation study c...

متن کامل

Performance of Supertree Methods on Various Dataset Decompositions

Many large-scale phylogenetic reconstruction methods attempt to solve hard optimization problems (such as Maximum Parsimony (MP) and Maximum Likelihood (ML)), but they are limited severely by the number of taxa that they can handle in a reasonable time frame. A standard heuristic approach to this problem is the divide-and-conquer strategy: decompose the dataset into smaller subsets, solve the s...

متن کامل

A likelihood look at the supermatrix-supertree controversy.

Supermatrix and supertree methods are two strategies advocated for phylogenetic analysis of sequence data from multiple gene loci, especially when some species are missing at some loci. The supermatrix method concatenates sequences from multiple genes into a data supermatrix for phylogenetic analysis, and ignores differences in evolutionary dynamics among the genes. The supertree method analyze...

متن کامل

Performance of flip supertree construction with a heuristic algorithm.

Supertree methods are used to assemble separate phylogenetic trees with shared taxa into larger trees (supertrees) in an effort to construct more comprehensive phylogenetic hypotheses. In spite of much recent interest in supertrees, there are still few methods for supertree construction. The flip supertree problem is an error correction approach that seeks to find a minimum number of changes (f...

متن کامل

Supertree bootstrapping methods for assessing phylogenetic variation among genes in genome-scale data sets.

Nonparamtric bootstrapping methods may be useful for assessing confidence in a supertree inference. We examined the performance of two supertree bootstrapping methods on four published data sets that each include sequence data from more than 100 genes. In "input tree bootstrapping," input gene trees are sampled with replacement and then combined in replicate supertree analyses; in "stratified b...

متن کامل

Assessment of the accuracy of matrix representation with parsimony analysis supertree construction.

Despite the growing popularity of supertree construction for combining phylogenetic information to produce more inclusive phylogenies, large-scale performance testing of this method has not been done. Through simulation, we tested the accuracy of the most widely used supertree method, matrix representation with parsimony analysis (MRP), with respect to a (maximum parsimony) total evidence solut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014